An Arithmetic Function and an Associated Probability Theorem
نویسندگان
چکیده
منابع مشابه
development and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAn Arithmetic Analogue of Bezout’s Theorem
In this paper, we prove two versions of an arithmetic analogue of Bezout’s theorem, subject to some technical restrictions. The basic formula proven is deg(V )h(X∩Y ) = h(X) deg(Y )+h(Y ) deg(X)+O(1), where X and Y are algebraic cycles varying in properly intersecting families on a regular subvariety VS ⊂ PS . The theorem is inspired by the arithmetic Bezout inequality of Bost, Gillet, and Soul...
متن کاملAn Arithmetic Proof of John’s Ellipsoid Theorem
Using an idea of Voronoi in the geometric theory of positive definite quadratic forms, we give a transparent proof of John’s characterization of the unique ellipsoid of maximum volume contained in a convex body. The same idea applies to the ‘hard part’ of a generalization of John’s theorem and shows the difficulties of the corresponding ‘easy part’. MSC 2000. 52A21, 52A27, 46B07.
متن کاملThe convolution inverse of an arithmetic function
Good, but does an inverse g of f have to exist? A necessary condition is that f(1) 6= 0. Indeed, if g is the inverse of f , then 1 = I(1) = (f ∗ g)(1) = f(1)g(1). We now show that this necessary condition is also sufficient. We assume that f(1) 6= 0 and we try and solve for g. What this means is that we are solving for infinitely many unknowns: g(1), g(2), . . . . From the above, we see that th...
متن کاملAn arithmetic function arising from Carmichael’s conjecture
Let φ denote Euler’s totient function. A century-old conjecture of Carmichael asserts that for every n, the equation φ(n) = φ(m) has a solution m 6= n. This suggests defining F (n) as the number of solutions m to the equation φ(n) = φ(m). (So Carmichael’s conjecture asserts that F (n) ≥ 2 always.) Results on F are scattered throughout the literature. For example, Sierpiński conjectured, and For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae (Proceedings)
سال: 1967
ISSN: 1385-7258
DOI: 10.1016/s1385-7258(67)50012-4